Integrality gaps for sparsest cut and minimum linear arrangement problemsDEVANUR, Nikhil R; KHOT, Subhash A; SAKET, Rishi et al.Annual ACM symposium on theory of computing. 2006, pp 537-546, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

Quantum weak coin-flipping with bias of 0.192MOCHON, Carlos.Annual Symposium on Foundations of Computer Science. 2004, pp 2-11, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Bornes duales de problèmes d'optimisation polynomiaux = Dual bounds of polynomial optimization problemsFerrier, Christophe; Dedieu, Jean-Pierre.1997, 156 p.Thesis

Initialization in semidefinite programming via a self-dual skew-symmetric embeddingDE KLERK, E; ROOS, C; TERLAKY, T et al.Operations research letters. 1997, Vol 20, Num 5, pp 213-221, issn 0167-6377Article

0.863-approximation algorithm for MAX DICUTMATUURA, Shiro; MATSUI, Tomomi.Lecture notes in computer science. 2001, pp 138-146, issn 0302-9743, isbn 3-540-42470-9Conference Paper

How good is the Goemans-Williamson MAX CUT algorithmKARLOFF, H.SIAM journal on computing (Print). 2000, Vol 29, Num 1, pp 336-350, issn 0097-5397Article

An exact duality theory for semidefinite programming and its complexity implicationsRAMANA, M. V.Mathematical programming. 1997, Vol 77, Num 2, pp 129-162, issn 0025-5610Article

A note on treating a second order cone program as a special case of a semidefinite programSIM, Chee-Khian; ZHAO, Gongyun.Mathematical programming. 2005, Vol 102, Num 3, pp 609-613, issn 0025-5610, 5 p.Article

Learning SVM kernel with semi-definite programmingSHUZHONG YANG; SIWEI LUO.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 1, 710-715Conference Paper

Multiparty quantum coin flippingAMBAINIS, Andris; BUHRMAN, Harry; DODIS, Yevgeniy et al.IEEE Conference on Computational Complexity. 2004, pp 250-259, isbn 0-7695-2120-7, 1Vol, 10 p.Conference Paper

A new moment matching algorithm for sampling from partially specified symmetric distributionsDATE, P; MAMON, R; JALEN, L et al.Operations research letters. 2008, Vol 36, Num 6, pp 669-672, issn 0167-6377, 4 p.Article

Applications of semidefinite programmingVANDENBERGHE, L; BOYD, S.Applied numerical mathematics. 1999, Vol 29, Num 3, pp 283-299, issn 0168-9274Conference Paper

Semidefinite programming in combinatorial optimizationGOEMANS, M. X.Mathematical programming. 1997, Vol 79, Num 1-3, pp 143-161, issn 0025-5610Conference Paper

O(√log n) APPROXIMATION TO SPARSEST CUT IN Õ(n²) TIMEARORA, Sanjeev; HAZAN, Elad; KALE, Satyen et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1748-1771, issn 0097-5397, 24 p.Article

Operations research in sportHURLEY, W. J.Computers & operations research. 2006, Vol 33, Num 7, issn 0305-0548, 211 p.Serial Issue

Semidefinite descriptions of cones defining spectral mask constraints : Advances in continuous optimizationFAYBUSOVICH, L.European journal of operational research. 2006, Vol 169, Num 3, pp 1207-1221, issn 0377-2217, 15 p.Conference Paper

Error bounds for eigenvalue and semidefinite matrix inequality systemsJOURANI, A; YE, J. J.Mathematical programming. 2005, Vol 104, Num 2-3, pp 525-540, issn 0025-5610, 16 p.Article

Semidefinite bounds for the stability number of a graph via sums of squares of polynomialsGVOZDENOVIC, Nebojsa; LAURENT, Monique.Lecture notes in computer science. 2005, pp 136-151, issn 0302-9743, isbn 3-540-26199-0, 16 p.Conference Paper

Robust convex quadratically constrained programsGOLDFARB, D; IYENGAR, G.Mathematical programming. 2003, Vol 97, Num 3, pp 495-515, issn 0025-5610, 21 p.Conference Paper

A subspace semidefinite programming for spectral graph partitioningOLIVEIRA, Suely; STEWART, David; SOMA, Takako et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-43591-3, 3Vol, vol. 1, 1058-1067Conference Paper

Symmetric primal-dual path-following algorithms for semidefinite programmingSTURM, J. F; SHUZHONG ZHANG.Applied numerical mathematics. 1999, Vol 29, Num 3, pp 301-315, issn 0168-9274Conference Paper

A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programmingMONTEIRO, R. D. C; YIN ZHANG.Mathematical programming. 1998, Vol 81, Num 3, pp 281-299, issn 0025-5610Article

Semidefinite optimization in discrepancy theoryBANSAL, Nikhil.Mathematical programming (Print). 2012, Vol 134, Num 1, pp 5-22, issn 0025-5610, 18 p.Conference Paper

A facial reduction algorithm for finding sparse SOS representationsWAKI, Hayato; MURAMATSU, Masakazu.Operations research letters. 2010, Vol 38, Num 5, pp 361-365, issn 0167-6377, 5 p.Article

Page / 20